Selecting DaoOpt solver configuration for MPE problems
نویسنده
چکیده
We address the problem of selecting the best configuration out of a set of configurations for DaoOpt an AND/OR Branch-and-Bound search based solver for combinatorial optimization problems expressed as MPE queries over graphical models. DaoOpt takes different parameters for solving a problem, the running time of a problem depends on the configuration chosen for it. We want to learn for a given problem instance which configuration is the fastest to solve it and predict the configuration likely to solve a new problem in the least amount of time. The results indicate that our predictor is able to improve the running time of the problems.
منابع مشابه
Benchmark on DAOOPT and GUROBI with the PASCAL2 Inference Challenge Problems
We report the PASCAL2 benchmark for DAOOPT and GUROBI on MPE task with 330 optimally solved instances from 8 benchmark domains. DAOOPT outperformed GUROBI in 3 domains, while GUROBI was faster than DAOOPT in the rest of the 5 domains. We show that DAOOPT performed well in domains where it could have high quality initial solutions for pruning the AND/OR search space, or skip search when the heur...
متن کاملThe Effects of Technical and Organizational Activities on Redundancy Allocation Problem with Choice of Selecting Redundancy Strategies Using the memetic algorithm
Redundancy allocation problem is one of most important problems in reliability area. This problem involves with the suitable redundancy levels under certain strategies to maximizing system reliability under some constraints. Many changes have been made on this problem to draw the problem near to real situations. Selecting the redundancy strategy, using different system configuration are some of...
متن کاملSolution of large-scale weighted least-squares problems
A sequence of least squares problems of the form miny kG1=2(AT y h)k2, where G is an n n positive definite diagonal weight matrix, and A anm n (m n) sparse matrix with some dense columns; has many applications in linear programming, electrical networks, elliptic boundary value problems, and structural analysis. We suggest low-rank correction preconditioners for such problems, and a mixed solver...
متن کاملUsing Self-learning and Automatic Tuning to Improve the Performance of Sexual Genetic Algorithms for Constraint Satisfaction Problems
Currently the parameters in a constraint solver are often selected by hand by experts in the field; these parameters might include the level of preprocessing to be used and the variable ordering heuristic. The efficient and automatic choice of a preprocessing level for a constraint solver is a step towards making constraint programming a more widely accessible technology. Self-learning sexual g...
متن کاملMPE Inference in Conditional Linear Gaussian Networks
Given evidence on a set of variables in a Bayesian network, the most probable explanation (MPE) is the problem of finding a configuration of the remaining variables with maximum posterior probability. This problem has previously been addressed for discrete Bayesian networks and can be solved using inference methods similar to those used for finding posterior probabilities. However, when dealing...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2016